YASCA: A collective intelligence approach for community detection in complex networks
نویسنده
چکیده
Complex networks are frequently used for modeling interactions in real-world systems in diverse areas, such as sociology, biology, information spreading and exchanging, scientometrics and many other different areas. One key topological feature of real-world complex networks is that nodes are arranged in tightly knit groups that are loosely connected one to each other. Such groups are called communities. Nodes composing a community are generally admitted to share common proprieties and/or be involved in a same function and/or having a same role. Hence, unfolding the community structure of a network could give us much insights about the overall structure a complex network. We distinguish between two different problems: partitioning the whole graph into (eventually overleaping) communities [Fortunato 2010] and identifying ego-centered communities for a given query node [Kanawati 2014a]. In this work we propose a new algorithm, YASCA, that use local community identification in order to compute a global graph partition into communities. The algorithm belongs to the seed centric algorithms family [Kanawati 2014b]. The basic idea of seed centric algorithms is to select a set of nodes (i.e. seeds) around which communities are constructed. Being based on local computations, these approaches are very attractive to deal with large-scale and/or dynamic networks. Different algorithms apply different policies for seed selection and for community construction around seeds. The number of seed nodes can be pre-determined [Khorasgani et al. 2010] or computed by the approach itself [Kanawati 2011]. The seed selection process can be : random [Khorasgani et al. 2010] or informed [Kanawati 2011]. The community construction can be made applying consensus techniques, expansion techniques or agglomeration techniques [Kanawati 2011]. Next we propose an original seed centric approach that apply an ensemble clustering approach [Strehl and Ghosh 2003] to different network partitions derived from ego-centered communities computed for each selected seed.
منابع مشابه
Community Detection using a New Node Scoring and Synchronous Label Updating of Boundary Nodes in Social Networks
Community structure is vital to discover the important structures and potential property of complex networks. In recent years, the increasing quality of local community detection approaches has become a hot spot in the study of complex network due to the advantages of linear time complexity and applicable for large-scale networks. However, there are many shortcomings in these methods such as in...
متن کاملIdentifying overlapping communities using multi-agent collective intelligence
The proposed algorithm in this research is based on the multi-agent particle swarm optimization as a collective intelligence due to the connection between several simple components which enables them to regulate their behavior and relationships with the rest of the group according to certain rules. As a result, self-organizing in collective activities can be seen. Community structure is crucial...
متن کاملLeveraging Collective Intelligence through Community Detection in Tag Networks
The paper studies the problem of community detection in tag networks, i.e. networks consisting of associations between tags that are used within Social Tagging Systems (STS) to annotate online resources (e.g. bookmarks, pictures, videos, etc.). Community detection methods aim at uncovering densely connected groups of tags, which can reveal the topic structure emerging in the STS. In this way, c...
متن کاملA Fast Approach to the Detection of All-Purpose Hubs in Complex Networks with Chemical Applications
A novel algorithm for the fast detection of hubs in chemical networks is presented. The algorithm identifies a set of nodes in the network as most significant, aimed to be the most effective points of distribution for fast, widespread coverage throughout the system. We show that our hubs have in general greater closeness centrality and betweenness centrality than vertices with maximal degree, w...
متن کاملA Multiagent Reinforcement Learning algorithm to solve the Community Detection Problem
Community detection is a challenging optimization problem that consists of searching for communities that belong to a network under the assumption that the nodes of the same community share properties that enable the detection of new characteristics or functional relationships in the network. Although there are many algorithms developed for community detection, most of them are unsuitable when ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1401.4472 شماره
صفحات -
تاریخ انتشار 2014